Algorithmic Problems in Amalgams of Finite Groups
نویسنده
چکیده
Geometric methods proposed by Stallings [53] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [4, 25, 37, 38, 43, 48, 56]. It turns out that Stallings’ methods can be effectively generalized for the class of amalgams of finite groups [39]. In the present paper we employ subgroup graphs constructed by the generalized Stallings’ folding algorithm, presented in [39], to solve various algorithmic problems in amalgams of finite groups.
منابع مشابه
Algorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection
Geometric methods proposed by Stallings [46] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [3, 19, 29, 30, 36, 41, 49]. In the present paper we employ the generalized Stallings’ methods, developed by the author in [32], to solve various algorithmic problems concerning finitely g...
متن کاملStallings Foldings and Subgroups of Amalgams of Finite Groups
In the 1980’s Stallings [35] showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse automaton. This allows for the deep algorithmic theory of finite automata and finite inverse monoids to be used to answer questions about finitely generate...
متن کاملGroup amalgams of index (4, 2) and 4-valent 2-arc-transitive graphs
A finite group amalgam of index (k,m) is a 5-tuple (L,φ,B, ψ,R) where L, B, and R are finite groups, φ : B → L and ψ : B → R are monomorphisms, and the indices of B and B in L and R are k and m, respectively. The amalgam is faithful if N ≤ B, N C L, and N C R implies N = 1. It is well known that the finite faithful amalgams of index (k, 2) are in a bijective correspondence with (the conjugacy c...
متن کاملAmalgams and the Coset Graph
Informally, an amalgam is a group ‘sitting inside’ two other groups and the coset graph is a way to look at how the cosets of subgroups interact. These are combined in the amalgam method — a way of classifying amalgams satisfying certain conditions. The amalgam method was used in the classifications of finite simple groups, and is discussed in Classification of Finite Simple Groups no. 2 by Gor...
متن کاملAmalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We study a general method of decomposing constraint satisfaction problems in which every constraint is represented as a disjunction of two or more simpler constraints defined, possibly, on smaller sets of values. We call a p...
متن کامل